Cluster Monte Carlo simulation of the transverse Ising model
نویسندگان
چکیده
منابع مشابه
Cluster Monte Carlo simulation of the transverse Ising model.
We formulate a cluster Monte Carlo method for the anisotropic limit of Ising models on (d+1)-dimensional lattices, which in effect, are equivalent with d-dimensional quantum transverse Ising models. Using this technique, we investigate the transverse Ising models on the square, triangular, Kagome, honeycomb, and simple-cubic lattices. The Monte Carlo data are analyzed by finite-size scaling. In...
متن کاملSingle-Cluster Monte Carlo Dynamics for the Ising Model
We present an extensive study of a new Monte Carlo acceleration algorithm introduced by Wolff for the Ising model. It differs from the Swendsen-Wang algorithm by growing and flipping single clusters at a random seed. In general, it is more efficient than Swendsen-Wang dynamics for d > 2, giving zero critical slowing down in the upper critical dimension. Monte Carlo simulations give dynamical cr...
متن کاملMonte Carlo Simulation of the 2D Ising model
Monte Carlo methods are a powerful tool to solve problems numerically which are di cult to be handled analytically. Nevertheless, these methods are applied to one of the best studied models in statistical physics in the following: The Ising model, which was invented by Wilhelm Lenz and investigated by his student Ernst Ising in the 1920ies. In particular, the two-dimensional case with interacti...
متن کاملMonte Carlo investigation of the Ising model
1 The Ising Model The Ising Model is a simple model of a solid that exhibits a phase transition resembling ferromagnetism. In this model, a “spin direction” is assigned to each vertex on a graph. The standard Hamiltonian for an Ising system includes only nearest-neighbor interactions and each spin direction may be either “up” (+1) or “down” (-1), though generalized models may include long-range...
متن کاملGeometric cluster Monte Carlo simulation
We discuss a cluster Monte Carlo algorithm for lattice models, based on geometric transformations. We prove detailed balance when the transformation is self-inverse, and a symmetry of the Hamiltonian. This algorithm opens new possibilities, in particular for the efficient simulation of critical model systems, where the Metropolis method suffers from critical slowing down. We illustrate the gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review E
سال: 2002
ISSN: 1063-651X,1095-3787
DOI: 10.1103/physreve.66.066110